Multi-player and Multi-round Auctions with Severely Bounded Communication
نویسندگان
چکیده
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible bids (i.e. he can send up to t = log(k) bits to the mechanism). This paper studies the loss of economic efficiency and revenue in such mechanisms, compared with the case of unconstrained communication. For any number of players, we present auctions that incur an efficiency loss and a revenue loss of O( 1 k ), and we show that this upper bound is tight. When we allow the players to send their bits sequentially, we can construct even more efficient mechanisms, but only up to a factor of 2 in the amount of communication needed. We also show that when the players’ valuations for the item are not independently distributed, we cannot do much better than a trivial mechanism.
منابع مشابه
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfareand profit-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove non-surprising properties of ...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملConstant-Round Concurrent Zero Knowledge in the Bounded Player Model
In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a priori bounded number of players in the system, however, each player may execute any unbounded (polynomial) number of sessions. They showed that even though the model consists of a relatively mild relaxation of the standard model, it allows for round-efficient concurrent ...
متن کاملOptimal internet auctions with costly communication
Iterative auctions can reach an outcome before all bidders have revealed all their preference information. This can decrease costs associated with communication, deliberation, and loss of privacy. We propose an explicit cost model that is inspired by single-item Internet auctions, such as those taking place on auction sites (eBay) or via informal communication (craigslist, mailing lists). A non...
متن کامل